On Rational Classical Orthogonal Polynomials and Their Application for Explicit Computation of Inverse Laplace Transforms
نویسندگان
چکیده
From the main equation (ax2 + bx + c)y′′ n (x) + (dx + e)y′ n(x)− n((n− 1)a+ d)yn(x) = 0, n∈ Z+, six finite and infinite classes of orthogonal polynomials can be extracted. In this work, first we have a survey on these classes, particularly on finite classes, and their corresponding rational orthogonal polynomials, which are generated by Mobius transform x = pz−1 + q, p = 0, q ∈ R. Some new integral relations are also given in this section for the Jacobi, Laguerre, and Bessel orthogonal polynomials. Then we show that the rational orthogonal polynomials can be a very suitable tool to compute the inverse Laplace transform directly, with no additional calculation for finding their roots. In this way, by applying infinite and finite rational classical orthogonal polynomials, we give three basic expansions of six ones as a sample for computation of inverse Laplace transform.
منابع مشابه
Recurrences and explicit formulae for the expansion and connection coefficients in series of the product of two classical discrete orthogonal polynomials
Suppose that for an arbitrary function $f(x,y)$ of two discrete variables, we have the formal expansions. [f(x,y)=sumlimits_{m,n=0}^{infty }a_{m,n},P_{m}(x)P_{n}(y),] $$ x^{m}P_{j}(x)=sumlimits_{n=0}^{2m}a_{m,,n}(j)P_{j+m-n}(x),$$ we find the coefficients $b_{i,j}^{(p,q,ell ,,r)}$ in the expansion $$ x^{ell }y^{r},nabla _{x}^{p}nabla _{y}^{q},f(x,y)=x^{ell }y^{r}f^{(p,q)}(x,y) =sumli...
متن کاملVolume Computation for Polytopes and Partition Functions for Classical Root Systems
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we present an efficient computation of the partition function for classical root systems.
متن کاملNumerical inversion of Laplace transform via wavelet in ordinary differential equations
This paper presents a rational Haar wavelet operational method for solving the inverse Laplace transform problem and improves inherent errors from irrational Haar wavelet. The approach is thus straightforward, rather simple and suitable for computer programming. We define that $P$ is the operational matrix for integration of the orthogonal Haar wavelet. Simultaneously, simplify the formulaes of...
متن کاملFair and Square Computation of Inverse -Transforms of Rational Functions
All methods presented in textbooks for computing inverse -transforms of rational functions have some limitation: 1) the direct division method does not, in general, provide enough information to derive an analytical expression for the time-domain sequence whose -transform is ; 2) computation using the inversion integral method becomes labored when has poles at the origin of the complex plane; 3...
متن کاملOrthogonal polynomials: applications and computation
We give examples of problem areas in interpolation, approximation, and quadrature, that call for orthogonal polynomials not of the classical kind. We then discuss numerical methods of computing the respective Gauss-type quadrature rules and orthogonal polynomials. The basic task is to compute the coefficients in the three-term recurrence relation for the orthogonal polynomials. This can be done...
متن کامل